Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times

A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequencedependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what R. Ruiz (B) Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática, Universitat Politècnica de València, Edificio 7A. Camino de Vera S/N, 46021, Valencia, Spain e-mail: [email protected] C. Andrés-Romano Departamento de Organización de Empresas, Universitat Politècnica de València, Edificio 7D. Camino de Vera S/N, 46021, Valencia, Spain e-mail: [email protected] characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed.